A hybrid of the restarted Arnoldi and electromagnetism meta-heuristic methods for calculating eigenvalues and eigenvectors of a non-symmetric matrix
نویسندگان
چکیده
In this paper, we present a new algorithm, which is called electromagnetism meta-heuristic restarted Arnoldi algorithm (EM-RA) for calculating eigenvalues and eigenvectors of a non-symmetric matrix. In most of the restarting methods the basic idea is a selection of the best initial eigenvector, but our aim is to improve the initial eigenvectors in each iteration of the restarting method. Numerical examples are used to show the good numerical properties. 2007 Published by Elsevier Inc.
منابع مشابه
Some new restart vectors for explicitly restarted Arnoldi method
The explicitly restarted Arnoldi method (ERAM) can be used to find some eigenvalues of large and sparse matrices. However, it has been shown that even this method may fail to converge. In this paper, we present two new methods to accelerate the convergence of ERAM algorithm. In these methods, we apply two strategies for the updated initial vector in each restart cycles. The implementation of th...
متن کاملA Harmonic Restarted Arnoldi Algorithm for Calculating Eigenvalues and Determining Multiplicity
A restarted Arnoldi algorithm is given that computes eigenvalues and eigenvectors. It is related to implicitly restarted Arnoldi, but has a simpler restarting approach. Harmonic and regular RayleighRitz versions are possible. For multiple eigenvalues, an approach is proposed that first computes eigenvalues with the new harmonic restarted Arnoldi algorithm, then uses random restarts to determine...
متن کاملChebyshev acceleration techniques for large complex non hermitian eigenvalue problems
The computation of a few eigenvalues and the corresponding eigenvectors of large complex non hermitian matrices arises in many applications in science and engineering such as magnetohydrodynamic or electromagnetism [6], where the eigenvalues of interest often belong to some region of the complex plane. If the size of the matrices is relatively small, then the problem can be solved by the standa...
متن کاملDynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
The Davidson method is a popular preconditioned variant of the Arnoldi method for solving large eigenvalue problems. For theoretical, as well as practical reasons the two methods are often used with restarting. Frequently, information is saved through approximated eigen-vectors to compensate for the convergence impairment caused by restarting. We call this scheme of retaining more eigenvectors ...
متن کاملImplicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations
The generalized minimum residual method (GMRES) is well known for solving large nonsymmetric systems of linear equations. It generally uses restarting, which slows the convergence. However, some information can be retained at the time of the restart and used in the next cycle. We present algorithms that use implicit restarting in order to retain this information. Approximate eigenvectors determ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Applied Mathematics and Computation
دوره 191 شماره
صفحات -
تاریخ انتشار 2007